A Fixed Point Method for Convex Systems

Some fixed point theorems and common fixed point theorem in log-convex structure

Some fixed point theorems and common fixed point theorem in Logarithmic convex structure areproved.

Fixed Point Theory for Almost Convex Functions

A fixed point theorem for convex and decreasing operators

In this paper, we present a new fixed point theorem for noncompact, convex and decreasing operators, which extends the existing corresponding results. As a sample, we give an application of the fixed point theorem to the two-point boundary value problem for a second-order differential equation. 2005 Elsevier Ltd. All rights reserved.

Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping

The existing algorithms for solving the convex minimization problem over the fixed point set of a nonexpansive mapping on a Hilbert space are based on algorithmic methods, such as the steepest descent method and conjugate gradient methods, for finding a minimizer of the objective function over the whole space, and attach importance to minimizing the objective function as quickly as possible. Me...

A Common Fixed Point Theorem Using an Iterative Method

Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence  ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...